Conflict sets in colored Petri nets

Generalizedd StochasticPetriNetsprovidethe modeller withh immediate transitions, but aa model will be correct only if the modeller cann specify how too solve the firingg conflicts betweenn these transitions. This task is usually cumbersome andd may be impossible for large nets. Inn confusion-free nets, these conflict sets are subsets of equivalence classes of aa structural conflict relation, whichh greatly simplifies the previous task. This paper solves the problem of detectingg confusionn in coloredd stochastic Petri nets andd computingg the equivalence classes of the structural conflict relation. Our approachh relies onn twoo techniques: the symbolic representationn of structural relations andd the definition of operations onn these symbolic relations. Combined withh the lumpingg methodd presentedd inn [13], our algorithm couldd be the basis of ann efficient tool for the analysis of coloredd Generalizedd Stochastic Petri Nets.